Related Articles ( Conjugate Gradient Method )
A New Parameter Conjugate Gradient Method Based on Three Terms Unconstrained Optimization
In this paper, we suggest a new conjugate gradient method for solving nonlinear unconstrained optimization problems by using three term conjugate gradient method, We give a descent condition and the sufficient descent condition of the suggested method.
A new class of three-term conjugate gradient methods for solving unconstrained minimization problems
Conjugate gradient (CG) methods which are usually generate descent search directions, are beneficial for large-scale unconstrained optimization models, because of its low memory requirement and simplicity. This paper studies the three-term CG method for unconstrained optimization. The modified a three-term ...
DHO conjugate gradient method for unconstrained optimization
In this paper, we suggest a new coefficient conjugate gradient method for nonlinear unconstrained optimization by using two parameters one of them is parameter of (FR) and the other one is parameter of (CD), we give a descent condition of the suggested method.
A New conjugate gradient method for unconstrained optimization problems with descent property
In this paper, we propose a new conjugate gradient method for solving nonlinear unconstrained optimization. The new method consists of three parts, the first part of them is the parameter of Hestenes-Stiefel (HS). The proposed method is satisfying the descent condition, sufficient descent condition and ...
A New Coefficient of Conjugate Gradient Method with Global Convergence for Unconstrained Optimization Problems
In this article, we defined a new coefficient formula of the conjugate gradient method for solving non linear unconstrained optimization problems. The new formula β new k is type of line search and the idea of our work is to focus on modification the Perry’s suggestion. We further show that ...